Competitive Coevolution through Evolutionary Complexification

نویسندگان

  • Risto Miikkulainen
  • Kenneth O. Stanley
چکیده

Two major goals in machine learning are the discovery of complex multidimensional solutions and continual improvement of existing solutions. In this paper, we argue that complexification, i.e. the incremental elaboration of solutions through adding new structure, achieves both these goals. We demonstrate the power of complexification through the NeuroEvolution of Augmenting Topologies (NEAT) method, which evolves increasingly complex neural network architectures. NEAT is applied to an open-ended coevolutionary robot duel domain where robot controllers compete head to head. Because the robot duel domain supports a wide range of sophisticated strategies, and because coevolution benefits from an escalating arms race, it serves as a suitable testbed for observing the effect of evolving increasingly complex controllers. The result is an arms race of increasingly sophisticated strategies. When compared to the evolution of networks with fixed structure, complexifying networks discover significantly more sophisticated strategies. The results suggest that in order to realize the full potential of evolution, and search in general, solutions must be allowed to complexify as well as optimize.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continual Coevolution Through Complexification

In competitive coevolution, the goal is to establish an “arms race” that will lead to increasingly sophisticated strategies. However, in practice, the process often leads to idiosyncrasies rather than continual improvement. Applying the NEAT method for evolving neural networks to a competitive simulated robot duel domain, we will demonstrate that (1) as evolution progresses the networks become ...

متن کامل

Winning Ant Wars: Evolving a Human-Competitive Game Strategy Using Fitnessless Selection

We tell the story of BrilliAnt, the winner of the Ant Wars contest organized within GECCO’2007, Genetic and Evolutionary Computation Conference. The task for the AntWars contestants was to evolve a controller for a virtual ant that collects food in a square toroidal grid environment in the presence of a competing ant. BrilliAnt, submitted to the contest by our team, has been evolved through com...

متن کامل

A game-theoretic model for punctuated equilibrium: species invasion and stasis through coevolution.

A general theory of coevolution is developed that combines the ecological effects of species' densities with the evolutionary effects of changing phenotypes. Our approach also treats the evolutionary changes between coevolving species with discreet traits after the appearance of a new species. We apply this approach to habitat selection models where new species first emerge through competitive ...

متن کامل

A Competitive Markov Approach to the Optimal Combat Strategies of On-Line Action Role-Playing Game Using Evolutionary Algorithms

In the case of on-line action role-playing game, the combat strategies can be divided into three distinct classes, Strategy of Motion(SM), Strategy of Attacking Occasion (SAO) and Strategy of Using Skill (SUS). In this paper, we analyze such strategies of a basic game model in which the combat is modeled by the discrete competitive Markov decision process. By introducing the chase model and the...

متن کامل

Improving the Performance of Multiobjective Evolutionary Optimization Algorithms Using Coevolutionary Learning

This chapter introduces two algorithms for multiobjective optimization. These algorithms are based on a state-of-the-art Multiobjective Evolutionary Algorithm (MOEA) called Strength Pareto Evolutionary Algorithm 2 (SPEA2). The first proposed algorithm implements a competitive coevolution technique within SPEA2. In contrast, the second algorithm introduces a cooperative coevolution technique to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Artif. Intell. Res.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2004